A Self-Applicable Supercompiler

A supercompiler is a program which can perform a deep transforma tion of programs using a principle which is similar to partial evaluation and can be referred to as metacomputation Supercompilers that have been in existence up to now see were not self applicable this is a more di cult problem than self application of a partial evaluator because of the more intricate logic of supercompilation In the present paper we describe the rst self applicable model of a supercompiler and present some tests Three features distinguish it from the previ ous models and make self application possible The input language is a subset of Refal which we refer to as at Refal The process of driving is performed as a transformation of pattern matching graphs Metasystem jumps are implemented which allows the supercom piler to avoid interpretation whenever direct computation is possible